Ten Years of Hoare's Logic: A Survey Part II: Nondeterminism
نویسنده
چکیده
At&ract. A survey of various results concerning the use of Hoare’s logic in proving correctness of nondeterministic programs is presented. Various proof systems together with the example proofs are given and the corresponding soundness and completeness proofs of the systems are dicussed. Programs allowing bounded and countable nondeterminism are studied. Proof systems de4 with partial and total correctness. freedom of failure and the issue of fairness. The paper is a continuation of Part I by Apt ( 1981). w-here various results concerning Hoax’s approach to proving correctness of sequential programs are presented.
منابع مشابه
Process Algebra and Hoare's Logic
A Hoare-like logic is introduced for deriving`partial correctness assertions' of the form fg p fg, where ; are unary predicates over some state space S and p is an expression over a recursive, non-uniform language containing global nondeterminism (+) and sequential composition (). This logic is (relatively) complete if only guarded recursion is considered.
متن کاملTen years of severe plastic deformation (SPD) in Iran, part II: accumulative roll bonding (ARB)
The present paper is the second part of a previously published overview entitled “ten years of severe plastic deformation (SPD) in Iran”. Part I concentrates on the equal channel angular pressing (ECAP). In this part, the focus is on the accumulative roll bonding (ARB) because, currently, Iran is ranked the first in the world by the total number of publications in this field. In the present sec...
متن کاملBeyond first order logic: From number of structures to structure of numbers: Part II
We study the history and recent developments in nonelementarymodel theory focusing on the framework of abstractelementary classes. We discuss the role of syntax and semanticsand the motivation to generalize first order model theory to nonelementaryframeworks and illuminate the study with concrete examplesof classes of models. This second part continues to study the question of catecoricitytrans...
متن کاملA Survey of Limited Nondeterminism in Computational Complexity Theory
OF THESIS A SURVEY OF LIMITED NONDETERMINISM IN COMPUTATIONAL COMPLEXITY THEORY Nondeterminism is typically used as an inherent part of the computational models used in computational complexity. However, much work has been done looking at nondeterminism as a separate resource added to deterministic machines. This survey examines several different approaches to limiting the amount of nondetermin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 28 شماره
صفحات -
تاریخ انتشار 1984